This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and (...) were revised and updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

Abraham Robinson’s framework for modern infinitesimals was developed half a century ago. It enables a re-evaluation of the procedures of the pioneers of mathematical analysis. Their procedures have been often viewed through the lens of the success of the Weierstrassian foundations. We propose a view without passing through the lens, by means of proxies for such procedures in the modern theory of infinitesimals. The real accomplishments of calculus and analysis had been based primarily on the elaboration of novel (...) techniques for solving problems rather than a quest for ultimate foundations. It may be hopeless to interpret historical foundations in terms of a punctiform continuum, but arguably it is possible to interpret historical techniques and procedures in terms of modern ones. Our proposed formalisations do not mean that Fermat, Gregory, Leibniz, Euler, and Cauchy were pre-Robinsonians, but rather indicate that Robinson’s framework is more helpful in understanding their procedures than a Weierstrassian framework. (shrink)

Resolution is an effective deduction procedure for classical logic. There is no similar "resolution" system for non-classical logics (though there are various automated deduction systems). The paper presents resolution systems for intuistionistic predicate logic as well as for modal and temporal logics within the framework of labelled deductive systems. Whereas in classical predicate logic resolution is applied to literals, in our system resolution is applied to L(abelled) R(epresentation) S(tructures). Proofs are discovered by a refutation procedure defined on (...) LRSs, that imposes a hierarchy on clause sets of such structures together with an inheritance discipline. This is a form of Theory Resolution. For intuitionistic logic these structures are called I(ntuitionistic) R(epresentation) S(tructures). Their hierarchical structure allows the restriction of unification of individual variables and/or constants without using Skolem functions. This structures must therefore be preserved when we consider other (non-modal) logics. Variations between different logics are captured by fine tuning of the inheritance properties of the hierarchy. For modal and temporal logics IRS's are extended to structures that represent worlds and/or times. This enables us to consider all kinds of combined logics. (shrink)

Undergraduate students with no prior classroom instruction in mathematical logic will benefit from this evenhanded multipart text by one of the centuries greatest authorities on the subject. Part I offers an elementary but thorough overview of mathematical logic of first order. The treatment does not stop with a single method of formulating logic; students receive instruction in a variety of techniques, first learning model theory (truth tables), then Hilbert-type proof theory, and proof (...) theory handled through derived rules. Part II supplements the material covered in Part I and introduces some of the newer ideas and the more profound results of logical research in the twentieth century. Subsequent chapters introduce the study of formal number theory, with surveys of the famous incompleteness and undecidability results of Godel, Church, Turing, and others. The emphasis in the final chapter reverts to logic, with examinations of Godel's completeness theorem, Gentzen's theorem, Skolem's paradox and nonstandard models of arithmetic, and other theorems. Unabridged republication of the edition published by John Wiley & Sons, Inc. New York, 1967. Preface. Bibliography. Theorem and Lemma Numbers: Pages. List of Postulates. Symbols and Notations. Index. (shrink)

I will give a brief overview of Saharon Shelah’s work in mathematical logic. I will focus on three transformative contributions Shelah has made: stability theory, proper forcing and PCF theory. The first is in model theory and the other two are in set theory.

This textbook is a second edition of the successful, Mathematical Logic: On Numbers, Sets, Structures, and Symmetry. It retains the original two parts found in the first edition, while presenting new material in the form of an added third part to the textbook. The textbook offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Part I, Logic Sets, and Numbers, (...) shows how mathematical logic is used to develop the number structures of classical mathematics. All necessary concepts are introduced exactly as they would be in a course in mathematical logic; but are accompanied by more extensive introductory remarks and examples to motivate formal developments. The second part, Relations, Structures, Geometry, introduces several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions, and shows how they are used to study and classify mathematical structures. The added Part III to the book is closer to what one finds in standard introductory mathematical textbooks. Definitions, theorems, and proofs that are introduced are still preceded by remarks that motivate the material, but the exposition is more formal, and includes more advanced topics. The focus is on the notion of countable categoricity, which analyzed in detail using examples from the first two parts of the book. This textbook is suitable for graduate students in mathematical logic and set theory and will also be of interest to mathematicians who know the technical aspects of the subject, but are not familiar with its history and philosophical background. (shrink)

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The (...) most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic. (shrink)

Mancosu, P., Generalizing classical and effective model theory in theories of operations and classes, Annas of Pure and Applied Logic 52 249-308 . In this paper I propose a family of theories of operations and classes with the aim of developing abstract versions of model-theoretic results. The systems are closely related to those introduced and already used by Feferman for developing his program of ‘explicit mathematics’. The theories in question are two-sorted, with one kind of variable (...) for individuals and the other for classes. The individual variables range over a domain closed under pairing and containing, among other things, natural numbers and operations.All the theories used assume a common group of axioms that insure that the individuals in the domain satisfy the conditions for a partial combinatory algebra with pairing. We also assume a class of natural numbers and a class induction axiom on . Finally there are various class existence axioms. I work mainly with three theories, FMT0, FMT and FMTΩ, which differ from each other both in their class existence axioms as well as in some further applicative axioms.These theories have various interpretations in which every object is explicitly presented by some means of definition as well as classical, or ‘standard’, set-theoretical interpretation. The systems are formulated in a flexible general language which can be used to prove abstract theorems of mathematics , thereby generalizing recursive, hyperarithmetic and admissible versions of classical mathematics.The aim of my work is to give an abstract development of portions of model theory in the afore-mentioned theories, in a way to look as much as possible like classical mathematics. Thus, FMT0 generalizes portions of countable and recursive model theory; FMT further generalizes portions of countable and hyperarithmetical model theory and finally FMTΩ provides a generalization of the classical L-completeness theorem and of an admissible version of L-completeness due to Bruce and Keisler. This continues the development of the program mentioned above, originating with Feferman. (shrink)

In recent years, mathematical logic has developed in many directions, the initial unity of its subject matter giving way to a myriad of seemingly unrelated areas. The articles collected here, which range from historical scholarship to recent research in geometric model theory, squarely address this development. These articles also connect to the diverse work of Väänänen, whose ecumenical approach to logic reflects the unity of the discipline.

Forcing extensions yield models of ZFC in which a long sequence of club subsets of ω 1 has the following property: every subsequence of size ℵ 1 has a finite intersection.

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between (...) semantics and logics . Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

Noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. After historical survey, lucid treatment of set theory, model theory, recursion theory and constructivism and proof theory. Place of problems in development of theories of logic, logic’s relationship to computer science, more. Suitable for readers at many levels of mathematical sophistication. 3 appendixes. Bibliography. 1981 edition.

Finite model theory is currently not one of the hot topics in the philosophy and history of mathematics, not even in the philosophy and history of mathematical logic. The philosophy of mathematics and mathematical logic has concentrated on infinite structures, closely related to foundational issues. In that context, finite models deserved only marginal attention because it was taken for granted that the study of finite structures is trivial compared to the study of infinite structures. (...) In retrospect, research on finite structures turned out to be neither trivial nor irrelevant but had an important impact on theoretical computer science. A closer look at the early history of the spectrum problem shows that the birth of finite model theory has roots in formal logic, at a time when computer science did not yet exist. (shrink)

The processing of information within the retino-tectal visual system of amphibians is decomposed into five major operational stages, three of them taking place in the retina and two in the optic tectum. The stages in the retina involve a spatially local high-pass filtering in connection to the perception of moving objects, separation of the receptor activity into ON- and OFF-channels regarding the distinction of objects on both light and dark backgrounds, spatial integration via near excitation and far-reaching inhibition. Variation of (...) the spatial range of excitation and inhibition allows to account for typical activities observed in a variety of classes of retina ganglion cells.Mathematical description of the operations in the tectum opticum include spatial summation of retinal output, and direct or indirect lateral inhibition between tectal cells. In the computer simulation, first the output of the mathematical retina model is computed which, then, is used as the input to the tectum model. The full spatio-temporal dynamics is taken into account.The simulations show that different combinations of strength of lateral inhibition on the one side and the response properties of the retina ganglion cells on the other side determine the response properties of tectal cell types involved in object recognition. (shrink)

The processing of information within the retino-tectal visual system of amphibians is decomposed into five major operational stages, three of them taking place in the retina and two in the optic tectum. The stages in the retina involve (i) a spatially local high-pass filtering in connection to the perception of moving objects, (ii) separation of the receptor activity into ON- and OFF-channels regarding the distinction of objects on both light and dark backgrounds, (iii) spatial integration via near excitation and far-reaching (...) inhibition. Variation of the spatial range of excitation and inhibition allows to account for typical activities observed in a variety of classes of retina ganglion cells.Mathematical description of the operations in the tectum opticum include (i) spatial summation of retinal output (mainly of class-2 and class-3 retina ganglion cells), and (ii) direct or indirect lateral inhibition between tectal cells. In the computer simulation, first the output of the mathematical retina model is computed which, then, is used as the input to the tectum model. The full spatio-temporal dynamics is taken into account. (shrink)

Witnessed models of fuzzy predicate logic are models in which each quantified formula is witnessed, i.e. the truth value of a universally quantified formula is the minimum of the values of its instances and similarly for existential quantification. Systematic theory of known fuzzy logics endowed with this semantics is developed with special attention paid to problems of arithmetical complexity of sets of tautologies and of satisfiable formulas.

A generalization of Ehrenfest''s urn model is suggested. This will allow usto treat a wide class of stochastic processes describing the changes ofmicroscopic objects. These processes are homogeneous Markov chains. Thegeneralization proposed is presented as an abstract conditional (relative)probability theory. The probability axioms of such a theory and some simpleadditional conditions, yield both transition probabilities and equilibriumdistributions. The resulting theory interpreted in terms of particles andsingle-particle states, leads to the usual formulae of quantum and classicalstatistical mechanics; (...) in terms of chromosomes and allelic types, it allowsthe deduction of many genetical models including the Ewens sampling formula;in terms of agents'' strategies, it gives a justification of the ``herdbehaviour'''' typical of a population of heterogeneous economic agents. (shrink)

Stemming from the works of Petr Hájek on mathematical fuzzy logic, graded model theory has been developed by several authors in the last two decades as an extension of classical model theory that studies the semantics of many-valued predicate logics. In this paper we take the first steps towards an abstract formulation of this model theory. We give a general notion of abstract logic based on many-valued models and prove six Lindström-style (...) characterizations of maximality of first-order logics in terms of metalogical properties such as compactness, abstract completeness, the Löwenheim–Skolem property, the Tarski union property, and the Robinson property, among others. As necessary technical restrictions, we assume that the models are valued on finite MTL-chains and the language has a constant for each truth-value. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (...) (J Symb Log 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and (...) made generally available to the public. To ensure a quality reading experience, this work has been proofread and republished using a format that seamlessly blends the original graphical elements with text in an easy-to-read typeface. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

Context: Epistemologically, constructivism has reached its goals, particularly by emphasizing the idea of participatory observation, circularity, and the fact that construction is based on experience. However, rather than research, the main occupation of constructivists and second-order cyberneticians seems to lie in making the case for their epistemological idea, which has been exhausted in many aspects. Purpose: To counteract this exhaustion and an increasingly apparent lack of energy, it is argued that constructivism requires a dedicated field of research, a field where (...) it would be possible to test constructivist concepts empirically and thus go beyond mere theoretical discourse. Method: Based on a review of basic constructivist premises and a critical examination of the field of empirical phenomenological research, the article connects their respective findings. Results: The article proposes that empirical research on lived experience requires a constructivist epistemological foundation and might therefore be a logical continuation of constructivist endeavours. In such a way, both fields might benefit considerably. Not only would constructivism acquire an empirical tool for testing its ideas, such a partnership might also provide empirical phenomenology with a more suitable epistemological platform than the realism-based research framework of cognitive science (of which it has become an integral part. The possibilities and problems of introducing empirical research into constructivism are also discussed. Implications: The article presents an opportunity to re-think the role and future of constructivism. It suggests educating a new generation of constructivist researchers whose principal goal would be the attempt to study lived human experience. That could also open a path to the experimental grounding of many constructivist insights. (shrink)

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems (...) follow. (shrink)

The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as (...) proof theory, computability theory, and model theory, the text also contains numerous carefully graded exercises and is ideal for a first or refresher course. (shrink)

Kurt Gödel’s Incompleteness theorem is well known in Mathematics/Logic/Philosophy circles. Gödel was able to find a way for any given P (UTM), (read as, “P of UTM” for “Program of Universal Truth Machine”), actually to write down a complicated polynomial that has a solution iff (=if and only if), G is true, where G stands for a Gödel-sentence. So, if G’s truth is a necessary condition for the truth of a given polynomial, then P (UTM) has to answer first (...) that G is true in order to secure the truth of the said polynomial. But, interestingly, P (UTM) could never answer that G was true. This necessarily implies that there is at least one truth a P (UTM), however large it may be, cannot speak out. Daya Krishna and Karl Potter’s controversy regarding the construal of India’s Philosophies dates back to the time of Potter’s publication of “Presuppositions of India’s Philosophies” (1963, Englewood Cliffs Prentice-Hall Inc.) In attacking many of India’s philosophies, Daya Krishna appears to have unwittingly touched a crucial point: how can there be the knowledge of a ‘non-cognitive’ mokṣa? [‘mokṣa’ is the final state of existence of an individual away from Social Contract]—See this author’s Indian Social Contract and its Dissolution (2008) mokṣa does not permit the knowledge of one’s own self in the ordinary way with threefold distinction, i.e., subject–knowledge-object or knower–knowledge–known. But what is important is to demonstrate whether such ‘knowledge’ of non-cognitive mokṣa state can be logically shown, in a language, to be possible to attain, and that there is no contradiction involved in such demonstration, because, no one can possibly express the ‘experience-itself’ in language. Hence, if such ‘knowledge’ can be shown to be logically not impossible in language, then, not only Daya Krishna’s arguments against ‘non-cognitive mokṣa’ get refuted but also it would show the possibility of achieving ‘completeness’ in its truest sense, as opposed to Gödel’s ‘Incompleteness’. In such circumstances, man would himself become a Universal Truth Machine. This is because the final state of mokṣa is construed as the state of complete knowledge in Advaita. This possibility of ‘completeness’ is set in this paper in the backdrop of Śrī Śaṅkarācārya’s Advaitic (Non-dualistic) claim involved in the mahāvākyas (extra-ordinary propositions). (Mahāvākyas that Śaṅkara refers to are basically taken from different Upaniṣads. For example, “Aham Brahmāsmi” is from Bṛhadāraṇyaka Upanisad, and “Tattvamasi” is from Chāndogya Upaniṣad. Śrī Śaṅkarācārya has written extensively. His main works include his Commentary on Brahma-Sūtras, on major Upaniṣads, and on ŚrīmadBhagavadGītā, called Bhāṣyas of them, respectively. Almost all these works are available in English translation published by Advaita Ashrama, 5 Dehi Entally Road, Calcutta, 700014.) On the other hand, the ‘Incompleteness’ of Gödel is due to the intervening G-sentence, which has an adverse self-referential element. Gödel’s incompleteness theorem in its mathematical form with an elaborate introduction by R.W. Braithwaite can be found in Meltzer (Kurt Gödel: on formally undecidable propositions of principia mathematica and related systems. Oliver & Boyd, Edinburgh, 1962). The present author believes first that semantic content cannot be substituted by any amount of arithmoquining, (Arithmoquining or arithmatization means, as Braithwaite says,—“Gödel’s novel metamathematical method is that of attaching numbers to the signs, to the series of signs (formulae) and to the series of series of signs (“proof-schemata”) which occur in his formal system…Gödel invented what might be called co-ordinate metamathematics…”) Meltzer (1962 p. 7). In Antone (2006) it is said “The problem is that he (Gödel) tries to replace an abstract version of the number (which can exist) with the concept of a real number version of that abstract notion. We can state the abstraction of what the number needs to be, [the arithmoquining of a number cannot be a proof-pair and an arithmoquine] but that is a concept that cannot be turned into a specific number, because by definition no such number can exist.”.), especially so where first-hand personal experience is called for. Therefore, what ultimately rules is the semanticity as in a first-hand experience. Similar points are voiced, albeit implicitly, in Antone (Who understands Gödel’s incompleteness theorem, 2006). (“…it is so important to understand that Gödel’s theorem only is true with respect to formal systems—which is the exact opposite of the analogous UTM (Antone (2006) webpage 2. And galatomic says in the same discussion chain that “saying” that it ((is)) only true for formal systems is more significant… We only know the world through “formal” categories of understanding… If the world as it is in itself has no incompleteness problem, which I am sure is true, it does not mean much, because that is not the world of time and space that we experience. So it is more significant that formal systems are incomplete than the inexperiencable ‘World in Itself’ has no such problem.—galatomic”) Antone (2006) webpage 2. Nevertheless galatomic certainly, but unwittingly succeeds in highlighting the possibility of experiencing the ‘completeness’ Second, even if any formal system including the system of Advaita of Śaṅkara is to be subsumed or interpreted under Gödel’s theorem, or Tarski’s semantic unprovability theses, the ultimate appeal would lie to the point of human involvement in realizing completeness since any formal system is ‘Incomplete’ always by its very nature as ‘objectual’, and fails to comprehend the ‘subject’ within its fold. (shrink)

We consider conditionals of the form A ⇒ B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals.Three main aspects will be investigated: Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).Comparison with similar features in modern law.New types of temporal logics arising (...) from modelling the Talmudic examples. We shall see that we need a new temporal logic,which we call Talmudic temporal logic with linear open advancing future and parallel changing past, based on two parameters for time. (shrink)

In Andreka-Nemeti [1] the class ST r of all small trees over C is dened for an arbitrary category C. Throughout the present paper C de- notes an arbitrary category. In Def. 4 of [1] on p. 367 the injectivity relation j= ) is dened. Intuitively the members of ST r represent the formulas and j= represents the validity relation be- tween objects of C considered as models and small trees of C considered as formulas. If ' 2 ST r (...) and a 2 Ob C then the statement a j= ' is associated to the model theoretic statement \the formula ' is valid in the model a". It is proved there that the Los lemma is true in every category C if we use the above quoted concepts. To this the notion of an ultra- product Pi2Iai=U of objects 2 IOb C of C if we use the above quoted concepts. To this the notion of an ultraproduct Pi2Iai=U of objects 2 IOb C of C is dened in [1], in [2] and in [7] Def. 12. Then the problem was asked there \for which categories is the characterization theorem of axiomatizable hulls of classes of models Mod T h K = Uf U p K true?", where the operators Uf and U p on classes of models is dened on p. 319 of the book [3]. Of course, here in the denition of Uf and U p on classes K Ob C of objects of C we have to replace the standard notion of ultraproducts of models by the above quoted category theoretic ultraproduct Pi2Iai=U of objects of C. That is for any C and K Ob C we dene U p K exactly as in [2] p. 136, but a more detailed denition is found in [7] Def. 17. (shrink)

We apply Benacerraf’s distinction between mathematical ontology and mathematical practice to examine contrasting interpretations of infinitesimal mathematics of the seventeenth and eighteenth century, in the work of Bos, Ferraro, Laugwitz, and others. We detect Weierstrass’s ghost behind some of the received historiography on Euler’s infinitesimal mathematics, as when Ferraro proposes to understand Euler in terms of a Weierstrassian notion of limit and Fraser declares classical analysis to be a “primary point of reference for understanding the eighteenth-century theories.” Meanwhile, (...) scholars like Bos and Laugwitz seek to explore Eulerian methodology, practice, and procedures in a way more faithful to Euler’s own. Euler’s use of infinite integers and the associated infinite products are analyzed in the context of his infinite product decomposition for the sine function. Euler’s principle of cancellation is compared to the Leibnizian transcendental law of homogeneity. The Leibnizian law of continuity similarly finds echoes in Euler. We argue that Ferraro’s assumption that Euler worked with a classical notion of quantity is symptomatic of a post-Weierstrassian placement of Euler in the Archimedean track for the development of analysis, as well as a blurring of the distinction between the dual tracks noted by Bos. Interpreting Euler in an Archimedean conceptual framework obscures important aspects of Euler’s work. Such a framework is profitably replaced by a syntactically more versatile modern infinitesimal framework that provides better proxies for his inferential moves. (shrink)

Traditional logic as a part of philosophy is one of the oldest scientific disciplines. Mathematical logic, however, is a relatively young discipline and arose from the endeavors of Peano, Frege, Russell and others to create a logistic foundation for mathematics. It steadily developed during the 20th century into a broad discipline with several sub-areas and numerous applications in mathematics, informatics, linguistics and philosophy. While there are already several well-known textbooks on mathematical logic, this book is (...) unique in that it is much more concise than most others, and the material is treated in a streamlined fashion which allows the professor to cover many important topics in a one semester course. Although the book is intended for use as a graduate text, the first three chapters could be understood by undergraduates interested in mathematical logic. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. This material is of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and other subjects. The remaining chapters contain material on logic programming for computer scientists, model theory, recursion theory, Godel’s Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed throughout the text. The author has provided exercises for each chapter, as well as hints to selected exercises. About the German edition: …The book can be useful to the student and lecturer who prepares a mathematical logic course at the university. What a pity that the book is not written in a universal scientific language which mankind has not yet created. - A.Nabebin, Zentralblatt. (shrink)

Aristotle is oftentimes viewed through a strictly philosophical lens as heir to Plato and has having introduced logical rigor where an emphasis on the theory of Forms formerly prevailed. It must be appreciated that Aristotle was the son of a physician, and that his inculcation of the thought of other Greek philosophers addressing health and the natural elements led to an extremely broad set of biologically- and medically-related writings. As this article proposes, Aristotle deepened the fourfold theory of (...) the elements with anatomic and physiologic observations. In books like History of Animals, Parts of Animals, and the lost Anatomai, he actively dissected organisms and recorded his findings. The corpus of medically-related literature Aristotle developed had a direct influence on subsequent Greek thinkers, including Galen, and on Medieval Islamic and modern Western practitioners such as William Harvey. Aristotle's ideas continue to influence modern medical thinkers in Europe and America through both his interpretation by European philosophers gaining the attention of medical humanists, and his writings' enduring impact on medical researchers balancing scientific with more personalistic approaches to medicine. (shrink)

We prove that Wilkie's identity holds in those natural HSI-algebras where each element has finite decomposition into components.Further, we construct a bunch of HSI-algebras that satisfy all the identities of the set of positive integers ℕ. Then, based on the constructed algebras, we prove that the identities of ℕ hold in the HSI-algebra of finite posets when the value of each variable is a poset having an isolated point.

This book is the first modern introduction to the logic of infinitary languages in forty years, and is aimed at graduate students and researchers in all areas of mathematical logic. Connections between infinitary model theory and other branches of mathematical logic, and applications to algebra and algebraic geometry are both comprehensively explored.

This is a short, modern, and motivated introduction to mathematical logic for upper undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in getting acquainted with logic and would like to learn Gödel’s incompleteness theorems should find this book particularly useful. The treatment is thoroughly mathematical and prepares students to branch out in several areas of mathematics related to foundations and computability, such as logic, axiomatic set theory, (...) class='Hi'>model theory, recursion theory, and computability. In this new edition, many small and large changes have been made throughout the text. The main purpose of this new edition is to provide a healthy first introduction to model theory, which is a very important branch of logic. Topics in the new chapter include ultraproduct of models, elimination of quantifiers, types, applications of types to model theory, and applications to algebra, number theory and geometry. Some proofs, such as the proof of the very important completeness theorem, have been completely rewritten in a more clear and concise manner. The new edition also introduces new topics, such as the notion of elementary class of structures, elementary diagrams, partial elementary maps, homogeneous structures, definability, and many more. (shrink)

The processing of information within the retino-tectal visual system of amphibians is decomposed into five major operational stages, three of them taking place in the retina and two in the optic tectum. The stages in the retina involve a spatially local high-pass filtering in connection to the perception of moving objects, separation of the receptor activity into ON- and OFF-channels regarding the distinction of objects on both light and dark backgrounds, spatial integration via near excitation and far-reaching inhibition. Variation of (...) the spatial range of excitation and inhibition allows to account for typical activities observed in a variety of classes of retina ganglion cells.Mathematical description of the operations in the tectum opticum include spatial summation of retinal output , and direct or indirect lateral inhibition between tectal cells. In the computer simulation, first the output of the mathematical retina model is computed which, then, is used as the input to the tectum model. The full spatio-temporal dynamics is taken into account.The simulations show that different combinations of strength of lateral inhibition on the one side and the response properties of the retina ganglion cells on the other side determine the response properties of tectal cell types involved in object recognition. (shrink)

Purpose. The paper is aimed to explicate a recently emerging anthropological model of homo eudaimonicus from its secular framework perspective. Theoretical basis. Secularity is considered in three aspects with reference to Taylor’s and Habermas’ ideas: as a common public sphere, as a phenomenological experience of living in a Secular Age, and as a background for happiness to become a major common value among other secular values in the Age of Authenticity. The modifications of happiness interpretation are traced from Early (...) Modernity till nowadays. The preconditions of the contemporary appeal to Aristotle’s eudaimonic theory of happiness are elucidated. The main characteristics of homo economicus anthropological model and reasons for its collapse in the contemporary world are analyzed. Specificities of the contemporary interpretations of eudaimonia are described with reference to the works of MacIntyre, Haybron, Hamilton, Kekes, Melnick, and others. A moral foundation and a behavioral strategy of homo eudaimonicus model are expounded and the role of this model in the life of a contemporary individual person and society is revealed. Originality. For the first time in the Ukrainian philosophical discourse, it is shown how secular ethics enables the rise of a new homo eudaimonicus model within a sphere of secularity; and it is argued that homo eudaimonicus is the result of overcoming the values crisis. It is revealed how homo eudaimonicus along with being descriptive becomes also a normative model of a new effective behavior strategy of a contemporary person facing the current social, economic, political, and environmental challenges. Conclusions. According to the contemporary interpretation, happiness as eudaimonia is a combination of the good life and the meaningful life; it is a human flourishing in this world through the accomplishment of a person’s life plan in the sphere of secularity. Homo eudaimonicus manifests the overcoming of values crisis and the rediscovery of purpose and meaning, this time on the secular basis. Homo eudaimonicus implies the realization of a person’s project of a happy and fulfilling life through moral behavior and socially useful activities. (shrink)

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of (...) classical mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage. The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging. This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students in relevant disciplines. (shrink)